Face recognition in JPEG compressed domain: a novel coefficient selection approach
نویسندگان
چکیده
JPEG compression standard is widely used for reducing the volume of images that are stored or transmitted via networks. In biometrics datasets, facial images are usually stored in JPEG compressed format and should be fully decompressed to be used in a face recognition system. Recently, in order to reduce the computational complexity of JPEG decompression step, face recognition in compressed domain is considered as an emerging topic in face recognition systems. In this paper, a novel coefficient selection method based on face segmentation has been proposed for selecting a limited number of zigzag scanned quantized coefficients in JPEG compressed domain, which led to an improvement in recognition accuracy and a reduction in computational complexity of the face recognition system. In the proposed method, different low frequency coefficients based on the importance of the regions of a face have been selected for recognition process. The experiments were conducted on FERET and FEI face databases, and PCA and ICA methods have been utilized to extract the features of the selected coefficients. Different criteria including recognition accuracy and time complexity metrics were employed in order to evaluate the performance of the proposedmethod, and the results have been compared with those of the state-of-the art methods. The results show the superiority of the proposed approach, in terms of recognition ranks, discriminatory power and time complexity aspects. M.-S. Moin ICT Research Institute, Tehran, Iran e-mail: [email protected] A. Sepas-Moghaddam (B) Faculty of Electrical and Computer Engineering, Islamic Azad University, Qazvin Branch, Qazvin, Iran e-mail: [email protected]
منابع مشابه
Face recognition in JPEG and JPEG2000 compressed domain
In this paper we investigate the potential of performing face recognition in JPEG and JPEG2000 compressed domain. This is achieved by avoiding full decompression and using transform coefficients as input to face recognition algorithms. We propose a new comparison methodology and by employing it show that face recognition can efficiently be implemented directly into compressed domain. In the fir...
متن کاملFace Recognition in compressed domain based on wavelet transform and kd-tree matching
This paper presents a novel idea for implementing face recognition system in compressed domain. A major advantage of the proposed approach is the fact that face recognition systems can directly work with JPEG and JPEG2000 compressed images, i.e. it uses directly the entropy points provided by the compression standards as input without any necessity of completely decompressing the image before r...
متن کاملTowards Face Recognition in JPEG2000 Compressed Domain, 14th International Workshop on Systems, Signals and Image Processing (IWSSIP) and 6th EURASIP Conference focused on Speech & Image Processing, Multimedia Communications and Services (EC-SIPMCS)
The goal of this research is to examine the feasibility of implementing face recognition algorithms directly into JPEG2000 compressed domain. By exploring some standard face recognition algorithms' behavior when fed with standard JPEG2000 DWT coefficients (CDF 9/7 wavelet), we will prove that recognition can be done directly in JPEG2000 compressed domain, avoiding inverse discrete wavelet trans...
متن کاملA Novel Temporal-Frequency Domain Error Concealment Method for Motion Jpeg
Motion-JPEG is a common video format for compression of motion images with highquality using JPEG standard for each frame of the video. During transmission through a noisychannel some blocks of data are lost or corrupted, and the quality of decompression frames decreased.In this paper, for reconstruction of these blocks, several temporal-domain, spatial-domain, andfrequency-domain error conceal...
متن کاملA Data Hiding Technique in JPEG Compressed Domain
JPEG is a common image format in the world wide web. JPEG-compressed images can be used to hide data for secret internet communication and simply any auxiliary data. In this paper, we propose an algorithm called J-Mark to embed invisible watermark information into JPEG compressed images in the compress domain. There are three parts of J-Mark: block selection, DCT coefficient selection, and modi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Signal, Image and Video Processing
دوره 9 شماره
صفحات -
تاریخ انتشار 2015